Semantics of infinite tree logic programming

Infinite-game Semantics for Logic Programming Languages

This thesis focuses on the study of the semantics of logic programs and the development of infinite games of perfect information between two players, that capture this semantics. We define a game that, given a propositional logic program with negation and a ground atom that belongs to it, may have three possible results (win for any of the players or tie). The game is determined. Based on this,...

. • Semantics of Subset - Logic Programming

Suitable semantics for Logic Programming

In this paper we introduce the notion of a suitable semantics which is very similar to the notion of a well behaved semantics. While well-behaved semantics ask for the relevance property, suitable semantics ask for ratio-nality. We argue that suitable semantics can be more appropiated than well-behaved semantics in some cases. We also introduce CSC, which is a suitable semantics deened via a co...

Bialgebraic Semantics for Logic Programming

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques developed in that setting. First we use saturation to model the operational semantics of logic programs...

Connuent Rewriting Systems for Logic Programming Semantics Connuent Rewriting Systems for Logic Programming Semantics

We introduce the general notion of a Connuent LP-System, which is a rewriting system on the set of all logic programs over a signature L. Such a system is based on certain transformation rules and induces a semantics SEM in a natural way. We show that most of the well-known semantics for normal logic programs are induced by connuent LP-systems. Moreover, we show by introducing several new trans...